Learning SEC<sub>p</sub> Languages from Only Positive Data
نویسندگان
چکیده
منابع مشابه
Learning Classifiers from Imbalanced, Only Positive and Unlabeled Data Sets
In this report, I presented my results to the tasks of 2008 UC San Diego Data Mining Contest. This contest consists of two classification tasks based on data from scientific experiment. The first task is a binary classification task which is to maximize accuracy of classification on an evenly-distributed test data set, given a fully labeled imbalanced training data set. The second task is also ...
متن کاملLearning Indexed Families of Recursive Languages from Positive Data
In the past 40 years, research on inductive inference has developed along different lines, concerning different formalizations of learning models and in particular of target concepts for learning. One common root of many of these is Gold’s model of identification in the limit. This model has been studied for learning recursive functions, recursively enumerable languages, and recursive languages...
متن کاملMind Change Speed-up for Learning Languages from Positive Data
Within the frameworks of learning in the limit of indexed classes of recursive languages from positive data and automatic learning in the limit of indexed classes of regular languages (with automatically computable sets of indices), we study the problem of minimizing the maximum number of mind changes FM(n) by a learner M on all languages with indices not exceeding n. For inductive inference of...
متن کاملLearning Concatenations of Locally Testable Languages from Positive Data
This paper introduces the class of concatenations of locally testable languages and its subclasses, and presents some results on the learnability of the classes from positive data. We rst establish several relationships among the language classes introduced, and give a su cient condition for a concatenation operation to preserve nite elasticity of a language class C. Then we show that, for each...
متن کاملLearning Languages from Positive Data and Negative Counterexamples
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the conjectures made by the learner. Several variants of this paradigm are considered that reflect different conditions/constraints on the type and size of negative counterexamples and on the time for obtaining them. In par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Triangle
سال: 2018
ISSN: 2013-939X
DOI: 10.17345/triangle8.1-18